Problems in Rewriting III
نویسندگان
چکیده
1 Department of Computer Science, University of Illinois, 1304 West Spring eld Avenue, Urbana, IL 61801, U.S.A, [email protected] 2 Laboratoire de Recherche en Informatique, Bat. 490, Universit e de Paris Sud, 91405 Orsay, France, [email protected] 3 CWI, Kruislaan 413, 1098 SJ Amsterdam, The Netherlands Department of Mathematics and Computer Science, Free University, de Boelelaan 1081, 1081 HV Amsterdam, The Netherlands, [email protected]
منابع مشابه
A Rewriting-Logic-Based Technique for Modeling Thermal Systems
This paper presents a rewriting-logic-based modeling and analysis technique for physical systems, with focus on thermal systems. The contributions of this paper can be summarized as follows: (i) providing a framework for modeling and executing physical systems, where both the physical components and their physical interactions are treated as first-class citizens; (ii) showing how heat transfer ...
متن کاملUpdate Rewriting and Integrity Constraint Maintenance in a Schema Evolution Support System: PRISM++
Supporting legacy applications when the database schema evolves represents a long-standing challenge of practical and theoretical importance. Recent work has produced algorithms and systems that automate the process of data migration and query adaptation; however, the problems of evolving integrity constraints and supporting legacy updates under schema and integrity constraints evolution are si...
متن کاملRewriting Modulo SMT
Combining symbolic techniques such as: (i) SMT solving, (ii) rewriting modulo theories, and (iii) model checking can enable the analysis of infinite-state systems outside the scope of each such technique. This paper proposes rewriting modulo SMT as a new technique combining the powers of (i)-(iii) and ideally suited to model and analyze infinite-state open systems; that is, systems that interac...
متن کاملPath Rewriting and Combined Word Problems
We give an algorithm solving combined word problems (over non necessarily disjoint signatures) based on rewriting of equivalence classes of terms. The canonical rewriting system we introduce consists of few transparent rules and is obtained by applying Knuth-Bendix completion procedure to presentations of pushouts among categories with products. It applies to pairs of theories which are both co...
متن کامل